Proper factorization systems in 2-categories
نویسندگان
چکیده
منابع مشابه
Constructions of Factorization Systems in Categories
In [2] we constructed homological localizations of spaces, groups, and 17"modules; here we generalize those constructions to give "factorization systems" and "homotopy factorization systems" for maps in categories. In Section 2 we recall the definition and basic properties of factorization systems, and in Section 3 we give our first existence theorem (3.1)for such systems. It can be viewed as a...
متن کاملOn the monad of proper factorisation systems in categories (*)
It is known that factorisation systems in categories can be viewed as unitary pseudo algebras for the monad P = (–)2, in Cat. We show in this note that an analogous fact holds for proper (i.e., epimono) factorisation systems and a suitable quotient of the former monad, deriving from a construct introduced by P. Freyd for stable homotopy. Some similarities of P with the structure of the path end...
متن کاملFactorization in categories of systems of linear partial differential equations
where the coefficients fs(x) belong to some differential field K. Factorization is a useful tool for computing a closed form solution of the corresponding linear ordinary differential equation Ly = 0 as well as determining its Galois group (see for example [46, 47, 54]). For simplicity and without loss of generality we suppose that operators (1) are reduced (i.e. f0(x) ≡ 1) unless we explicitly...
متن کاملFactorization Homology of Enriched ∞-categories
For an arbitrary symmetric monoidal∞-category V, we define the factorization homology of V-enriched∞-categories over (possibly stratified) 1-manifolds and study its basic properties. In the case that V is cartesian symmetric monoidal, by considering the circle and its self-covering maps we obtain a notion of unstable topological cyclic homology, which we endow with an unstable cyclotomic trace ...
متن کاملPopulating Categories using Constrained Matrix Factorization
Matrix factorization methods are a well-scalable means of discovering generalizable information in noisy training data with many examples and many features. We propose a method to populate a given ontology of categories and seed examples using matrix factorization with constraints, based on a large corpus of noun-phrase/context cooccurrence statistics. While our method performs reasonably well ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2003
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(02)00244-x